منابع مشابه
Asymptotic enumeration of strongly connected digraphs by vertices and edges
We derive an asymptotic formula for the number of strongly connected digraphs with n vertices and m arcs (directed edges), valid for m − n → ∞ as n → ∞ provided m = O(n log n). This fills the gap between Wright’s results which apply to m = n+O(1), and the long-known threshold for m, above which a random digraph with n vertices and m arcs is likely to be strongly connected.
متن کاملEfficient Fault-Tolerant Fixed Routings on (k + 1)-Connected Digraphs
Wada, K. and K. Kawaguchi, Efficient fault-tolerant fixed routings on (k+ 1)connected digraphs, Discrete Applied Mathematics 37/38 (1992) 539-552. Consider a directed communication network G in which a limited number of directed link and/or node faults F might occur. A routing Q for the network (a fixed path for each ordered pair of nodes) must be chosen without knowing which components might b...
متن کاملDegree sequence for k-arc strongly connected multiple digraphs
Let D be a digraph on [Formula: see text]. Then the sequence [Formula: see text] is called the degree sequence of D. For any given sequence of pairs of integers [Formula: see text], if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable and D is a realization of d. In this paper, characterizations for k-arc-connected realizable sequenc...
متن کاملApproximation algorithms for minimum-cost k-(S, T ) connected digraphs
We introduce a model for NP-hard problems pertaining to the connectivity of graphs, and design approximation algorithms for some of the key problems in this model. One of the well-known NP-hard problems is to find a minimum-cost strongly connected spanning subgraph of a directed network. In the minimum-cost k-(S, T ) connected digraph (abbreviated, k-(S, T ) connectivity) problem we are given a...
متن کاملOn spectral radius of strongly connected digraphs
It is known that the directed cycle of order $n$ uniquely achieves the minimum spectral radius among all strongly connected digraphs of order $nge 3$. In this paper, among others, we determine the digraphs which achieve the second, the third and the fourth minimum spectral radii respectively among strongly connected digraphs of order $nge 4$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
سال: 2017
ISSN: 0025-5858,1865-8784
DOI: 10.1007/s12188-016-0173-y